Collocation analysis for UMLS knowledge-based word sense disambiguation
نویسندگان
چکیده
منابع مشابه
Word Clustering for Collocation-Based Word Sense Disambiguation
The main disadvantage of collocation-based word sense disambiguation is that the recall is low, with relatively high precision. How to improve the recall without decrease the precision? In this paper, we investigate a word-class approach to extend the collocation list which is constructed from the manually sense-tagged corpus. But the word classes are obtained from a larger scale corpus which i...
متن کاملKnowledge Lean Word-Sense Disambiguation
We present a corpus based approach to word sense disambiguation that only requires information that can be automatically extracted from untagged text We use unsupervised techniques to estimate the pa rameters of a model describing the conditional distri bution of the sense group given the known contextual features Both the EM algorithm and Gibbs Sampling are evaluated to determine which is most...
متن کاملSense Embeddings in Knowledge-Based Word Sense Disambiguation
In this paper, we develop a new way of creating sense vectors for any dictionary, by using an existing word embeddings model, and summing the vectors of the terms inside a sense’s definition, weighted in function of their part of speech and their frequency. These vectors are then used for finding the closest senses to any other sense, thus creating a semantic network of related concepts, automa...
متن کاملKnowledge Sources for Word Sense Disambiguation
Two kinds of systems have been defined during the long history of WSD: principled systems that define which knowledge types are useful for WSD, and robust systems that use the information sources at hand, such as, dictionaries, light-weight ontologies or hand-tagged corpora. This paper tries to systematize the relation between desired knowledge types and actual information sources. We also comp...
متن کاملRandom Walks for Knowledge-Based Word Sense Disambiguation
Word Sense Disambiguation (WSD) systems automatically choose the intended meaning of a word in context. In this article we present a WSD algorithm based on random walks over large Lexical Knowledge Bases (LKB). We show that our algorithm performs better than other graphbased methods when run on a graph built from WordNet and eXtended WordNet. Our algorithm and LKB combination compares favorably...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2011
ISSN: 1471-2105
DOI: 10.1186/1471-2105-12-s3-s4